<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW">
    <link rel="icon" href="../images/logo/logo.png" type="image/x-icon">
    <link rel="shortcut icon" href="../images/logo/logo.png"
          type="image/x-icon">
    <title>浏阳德塔软件开发有限公司 女娲计划</title>
</head>
<body style="Max-width: 700px; text-align:center; margin:auto;">
<div style="text-align:left; Max-width: 680px; margin-left:15px;">
    <a href="../">上一页</a>
    <br/>
    <br/>
    <br/>第二章 Java 数据分析算法引擎系统
    <br/> 作者: 罗瑶光, Author:Yaoguang.Luo<br/>
    <br/>
    <br/>基础应用: 元基催化与肽计算 编译机的仿生分析机
    <br/>
    <br/>
    极速象契拼音笔画排序 <br/>
    <br/>
    极速象契拼音笔画排序描述: <br/>
    <br/>
    首先作者设计该算法前已经有了极速排序为基础. 于是尝试将字符串的按拼音和笔画进行象契综合计算来排序.
    中文的拼音和笔画, 可以在康熙字典, 词源和新华字典上进行录入. 作者录入的方式比较简单统一为map,
    其中文字key对应拼音和笔画value, 进行相应的索引. 这个过程为索引的map预处理. (作者有百度和豆丁
    文库的词汇购买记录, 如 新华字典的中文汉字, 康熙字典, 国家语言等级词汇等等. 目前百度帐号OK、,
    但豆丁不是15116110525和qq绑定, 而是用作者的微信sweet00048帐号来绑定的, 2022年3月2号前莫名
    被腾讯永久冻结, 因为此事非常蹊跷, 所以作者至今也不会解绑, 当然以后也不会解绑,
    所以国家依旧能查到. )
    <br/><br/>
    作者将这些购买的原材料doc和txt文档进行加工处理生成了2个txt格式的拼音词库文件和笔画词库文件.
    于是开始计算字符串比对排序. 作者按通用的拼音进行指针对应的每两行两行进行极快速微分催化,
    小高峰过滤, 左右比对法综合按快速排序的方式(目前是top sort 5D)进行从a到z进行char对应int大小
    来计算排列. 当出现拼音完全相同的字的时候, 于是比对这个同音字的笔画的多少进行深化条件补充排序.
    如果在这个 时候依旧出现既相同拼音, 又相同笔画的字的场景, 作者便根据字符的char的ascii编码,
    (utf8, gbk, gb2312 都有相应的文字int编码)来区分. 于是把这整个过程中一些恒定的中间变量全局
    化作为带 精度观测 入参, 进行自适应. 目前这个算法的函数一直在进行DNA元基催化编码索引的新陈代谢
    +二次新陈 代谢进化 排序优化中. 描述人 罗瑶光 <br/>
    <br/>
    Definition: Speed Sorting the Hieroglyphics and Cuneiform characters by
    using a sequence of phonetics and strokes. <br/>
    <br/>
    Firstly, the author had already touched on a good foundation of
    quicksort and data structure by using C in Christ University since
    2008. Then tried to sort the mixed string of Hieroglyphics and
    Cuneiform characters in a way of phonetics and spelling strokes. And
    those Hieroglyphics, Cuneiform characters, phonetics and spelling
    strokes, were arranged and built as object keymaps. The author did a
    comparative way of those string characters with an ASCII contrast,
    which means the numeric ASCII of these alphabetic chars. The distinct
    workflow as below. While the sort engine found two characters were the
    same in phonetics, then began to check Its conditional strokes. While
    the sort engine found two characters were the same in phonetics and
    strokes. Then began to check the numeric ASCII of these two alphabetic
    chars.
    <img class="banner_img" style="width: 100%" src="../images/5_7108/2/2_21.jpg"
         alt="浏阳德塔软件开发有限公司,罗瑶光"/>
</div>
</body>